Computing Properties of Numerical Imperative Programs by Symbolic Computation
نویسندگان
چکیده
We show how properties of an interesting class of imperative programs can be calculated by means of relational modeling and symbolic computation. The ideas of [5, 26] are implemented using symbolic computations based on Maple [30].
منابع مشابه
Algebraic Power Analysis by Abstract Interpretation
In this paper we design abstract domains for power analysis. These domains are conceived to discover properties of the following type: “The variable X at a given program point is the power of c with the exponent having a given property π”, where c and π are automatically determined. This construction is general and includes different algebraic entities, such as numerical and polynomial (with ra...
متن کاملProgram Verification by Calculating Relations
We show how properties of an interesting class of imperative programs can be verifed by means of relational modelling and symbolic computation.
متن کاملAutomatic Derivation and Implementation of Signal Processing Algorithms † Sebastian Egner
We present a computer algebra framework to automatically derive and implement algorithms for digital signal processing. The two main parts of the framework are AREP, a library for symbolic manipulation of group representations and structured matrices, and SPL, a compiler turning matrix expressions into efficient imperative-style numerical programs.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملSymbolic Computation and Program Verification. Proving Partial Correctness and Synthesizing Optimal Algorithms∗
We present methods for checking the partial correctness of, respectively to optimize, imperativeprograms, using polynomial algebra methods, namely resultant computation and quantifier elimina-tion (QE) by cylindrical algebraic decomposition (CAD). The results are very promising but alsoshow that there is room for improvement of algebraic algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 80 شماره
صفحات -
تاریخ انتشار 2007